package cn.pugle.oj.leetcode;

import cn.pugle.oj.catalog.MathProblem;

/**
 * 各种数论, 艹
 * https://leetcode.com/problems/super-pow/
 *
 * LC50_2
 *
 * @author tzp
 * @since 2020/11/3
 */
public class LC372 extends LC50_2 implements MathProblem {
    public static final int MO = 1337;

    public int superPow(int a, int[] b) {
        if (b.length == 1 && b[0] == 0) return 1 % MO;
        a = a % MO;
        double ans = a, base = a;// ans：幂的结果；base：底数a
        //a^B = a^x * a^x * a^x
        //求a^B % 1337

        return -1;
    }

    public static void main(String[] args) {
        System.out.println(new LC372());
    }
}
